Dynamic Classification of Repetitive Jobs In Linux For Energy-Aware Scheduling: A Feasibility Study
نویسندگان
چکیده
The workload offered to a typical server consists of many repeated tasks. We present and evaluate a feasibility study that shows how repetitive server workloads can be exploited to enhance the server and CPU energy savings realized by state-of-the-art linux power governors. To minimize dramatic modifications to the web server and the core kernel scheduler we exploit the forensic logging capabilities of the Apache server to collect workload specific information and to schedule requests. We use a daemon to collect the classification statistics and control the dynamic voltage frequency scaling (DVFS) setting of the kernel to batch schedule requests with similar characteristics and thus amortize the energy and performance overhead of making changes to the DVFS settings. Our experimental results show that an energy savings of up to ten percent can be realized for the server on the workloads generated by the SPECweb2005 benchmarks. Keywords-Energy Conservation; Power Savings; Process Management;Web Server; Performance Experiment; Scheduling; Measurement, Power Measurements, Energy Reduction
منابع مشابه
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملPower-Aware Parallel Job Scheduling
Recent increase in performance of High Performance Computing (HPC) centers has been followed by even higher increase in power consumption. Power draw of modern supercomputers is not only an economic problem but it has negative consequences on environment. Roughly speaking, CPU power presents 50% of total system power. Dynamic Voltage Frequency Scaling(DVFS) is a technique widely used to manage ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013